Percolation in Self-Similar Networks
نویسندگان
چکیده
منابع مشابه
Percolation in self-similar networks
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering, scale-free graphs with finite clustering and metric structure, growing scale-free networks, and many real networks. The proof and the derivation of the giant ...
متن کاملTesting Self-Similar Networks
Network testing presents different challenges from software testing. One challenge is that only a small number of networks, at best, can actually be tested, even when the goal is to test a class of networks. One solution is to select a representative network, which will display any faults present in any network of the class. This paper introduces the use of “self-similarity” to select such a ne...
متن کاملProbability , Networks and Algorithms Self - destructive percolation
CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ABSTRACT Consider ordinary site percolation on an infinite graph in which the sites, independent of each other, are occupied with probability p and vacant with probability 1−p. Now suppose that, by some 'catastrophe', all sites which are ...
متن کاملStatistical self-similar properties of complex networks.
It has been shown that many complex networks shared distinctive features, which differ in many ways from the random and the regular networks. Although these features capture important characteristics of complex networks, their applicability depends on the type of networks. To unravel ubiquitous characteristics that complex networks may have in common, we adopt the clustering coefficient as the ...
متن کاملSelf-similar scale-free networks and disassortativity.
Self-similar networks with scale-free degree distribution have recently attracted much attention, since these apparently incompatible properties were reconciled in [C. Song, S. Havlin, and H. A. Makse, Nature 433, 392 (2005)] by an appropriate box-counting method that enters the measurement of the fractal dimension. We study two genetic regulatory networks (Saccharomyces cerevisiae [N. M. Lusco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2011
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.106.048701